A Simulation Study of Evaluation Heuristics for Tug Fleet Optimisation Algorithms

نویسندگان

  • Robin T. Bye
  • Hans Georg Schaathun
چکیده

Tug fleet optimisation algorithms can be designed to solve the problem of dynamically positioning a fleet of tugs in order to mitigate the risk of oil tanker drifting accidents. In this paper, we define the tug fleet optimisation problem and present the details of a receding horizon genetic algorithm for solving it. The algorithm can be configured with a set of cost functions such that each configuration effectively constitute a unique tug fleet optimisation algorithm. To measure the performance, or merit, of such algorithms, we propose two evaluation heuristics and test them by means of a computational simulation study. Finally, we discuss our findings and some of our related work on parallelisation and a 2D nonlinear mixed integer programming formulation of the problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluation Heuristics for Tug Fleet Optimisation Algorithms - A Computational Simulation Study of a Receding Horizon Genetic Algorithm

A fleet of tugs along the northern Norwegian coast must be dynamically positioned to minimise the risk of oil tanker drifting accidents. We have previously presented a receding horizon genetic algorithm (RHGA) for solving this tug fleet optimisation (TFO) problem. Here, we first present an overview of the TFO problem, the basics of the RHGA, and a set of potential cost functions with which the ...

متن کامل

An Improved Receding Horizon Genetic Algorithm For The Tug Fleet Optimisation Problem

A fleet of tugs along the northern Norwegian coast must be dynamically positioned to minimise the risk of oil tanker drifting accidents. We have previously presented a receding horizon genetic algorithm (RHGA) for solving this tug fleet optimisation (TFO) problem. In this paper, we begin by presenting an overview of the TFO problem and the details of the RHGA. Next, we identify and correct a fl...

متن کامل

Three New Heuristic Algorithms For The Fleet Size And Mix Green Vehicle Routing Problem

In recent years, great efforts have been made to reduce greenhouse gas emissions by vehicles. Petroleum products produces greenhouse gas emissions, therefore reducing the use of these products can make a major contribution to reducing pollution. The Fleet Size and Mix Vehicle Routing Problem is one of the most widely used routing branches. In this problem, there are vehicle with different capac...

متن کامل

A Comparison of NSGA II and MOSA for Solving Multi-depots Time-dependent Vehicle Routing Problem with Heterogeneous Fleet

Time-dependent Vehicle Routing Problem is one of the most applicable but least-studied variants of routing and scheduling problems. In this paper, a novel mathematical formulation of time-dependent vehicle routing problems with heterogeneous fleet, hard time widows and multiple depots, is proposed. To deal with the traffic congestions, we also considered that the vehicles are not forced to come...

متن کامل

A Simulation Model for Optimization of the Internal Handling Fleet Size at Shahid Rajaee Container Port Based on Performance Evaluation

The dramatic increasing of sea-freight container transportations and the developing trend for using containers in the multimodal handling systems through the sea, rail, road and land in the present market cause some challenges to the general managers of container terminals such as increasing demand, competitive situation, new investments and expansion of new activities and the need to use new m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015